Plurigraph Coloring and Scheduling Problems
نویسندگان
چکیده
منابع مشابه
Plurigraph Coloring and Scheduling Problems
We define a new type of vertex coloring which generalizes vertex coloring in graphs, hypergraphs, and simplicial complexes. This coloring also generalizes oriented coloring, acyclic coloring, and star coloring. There is an associated symmetric function in noncommuting variables for which we give a deletion-contraction formula. In the case of graphs this symmetric function in noncommuting variab...
متن کاملScheduling Problems and Generalized Graph Coloring
We define a new type of vertex coloring which generalizes vertex coloring in graphs, hypergraphs, and simplicial complexes. To this coloring there is an associated symmetric function in noncommuting variables for which we give a deletion-contraction formula. In the case of graphs our symmetric function in noncommuting variables agrees with the chromatic symmetric function in noncommuting variab...
متن کامل"Rent-or-Buy" Scheduling and Cost Coloring Problems
We study several cost coloring problems, where we are given a graph and a cost function on the independent sets and are to find a coloring that minimizes the function costs of the color classes. The “Rent-or-Buy” scheduling/coloring problem (RBC) is one that captures e.g., job scheduling situations involving resource constraints where one can either pay a full fixed price for a color class (rep...
متن کاملGraph Coloring Problems and Their Applications in Scheduling
Graph coloring and its generalizations are useful tools in modeling a wide variety of scheduling and assignment problems. In this paper we review several variants of graph coloring, such as precoloring extension, list coloring, multicoloring, minimum sum coloring, and discuss their applications in scheduling.
متن کاملA Graph Coloring Algorithm for Large Scheduling Problems*
A ne w graph coloring algorit hm is prese nt ed and compared to a wide variety of known algorit hms. The algorithm is shown to exhibit O(n 2) time be havior for most s parse graphs and thus is found to be parti cularl y well suited for use wi th large-scale sc heduling problems. In addition, a procedure for ge nerating large random test graphs with known chromatic number is present ed and is us...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2017
ISSN: 1077-8926
DOI: 10.37236/6818